Image harmonization aims to produce visually harmonious composite images by adjusting the foreground appearance to be compatible with the background. When the composite image has photographic foreground and painterly background, the task is called painterly image harmonization. There are only few works on this task, which are either time-consuming or weak in generating well-harmonized results. In this work, we propose a novel painterly harmonization network consisting of a dual-domain generator and a dual-domain discriminator, which harmonizes the composite image in both spatial domain and frequency domain. The dual-domain generator performs harmonization by using AdaIn modules in the spatial domain and our proposed ResFFT modules in the frequency domain. The dual-domain discriminator attempts to distinguish the inharmonious patches based on the spatial feature and frequency feature of each patch, which can enhance the ability of generator in an adversarial manner. Extensive experiments on the benchmark dataset show the effectiveness of our method. Our code and model are available at https://github.com/bcmi/PHDNet-Painterly-Image-Harmonization.

The number of international benchmarking competitions is steadily increasing in various fields of machine learning (ML) research and practice. So far, however, little is known about the common practice as well as bottlenecks faced by the community in tackling the research questions posed. To shed light on the status quo of algorithm development in the specific field of biomedical imaging analysis, we designed an international survey that was issued to all participants of challenges conducted in conjunction with the IEEE ISBI 2021 and MICCAI 2021 conferences (80 competitions in total). The survey covered participants' expertise and working environments, their chosen strategies, as well as algorithm characteristics. A median of 72% challenge participants took part in the survey. According to our results, knowledge exchange was the primary incentive (70%) for participation, while the reception of prize money played only a minor role (16%). While a median of 80 working hours was spent on method development, a large portion of participants stated that they did not have enough time for method development (32%). 25% perceived the infrastructure to be a bottleneck. Overall, 94% of all solutions were deep learning-based. Of these, 84% were based on standard architectures. 43% of the respondents reported that the data samples (e.g., images) were too large to be processed at once. This was most commonly addressed by patch-based training (69%), downsampling (37%), and solving 3D analysis tasks as a series of 2D tasks. K-fold cross-validation on the training set was performed by only 37% of the participants and only 50% of the participants performed ensembling based on multiple identical models (61%) or heterogeneous models (39%). 48% of the respondents applied postprocessing steps.

While Named Entity Recognition (NER) is a widely studied task, making inferences of entities with only a few labeled data has been challenging, especially for entities with nested structures. Unlike flat entities, entities and their nested entities are more likely to have similar semantic feature representations, drastically increasing difficulties in classifying different entity categories in the few-shot setting. Although prior work has briefly discussed nested structures in the context of few-shot learning, to our best knowledge, this paper is the first one specifically dedicated to studying the few-shot nested NER task. Leveraging contextual dependency to distinguish nested entities, we propose a Biaffine-based Contrastive Learning (BCL) framework. We first design a Biaffine span representation module for learning the contextual span dependency representation for each entity span rather than only learning its semantic representation. We then merge these two representations by the residual connection to distinguish nested entities. Finally, we build a contrastive learning framework to adjust the representation distribution for larger margin boundaries and more generalized domain transfer learning ability. We conducted experimental studies on three English, German, and Russian nested NER datasets. The results show that the BCL outperformed three baseline models on the 1-shot and 5-shot tasks in terms of F1 score.

Image super-resolution is a common task on mobile and IoT devices, where one often needs to upscale and enhance low-resolution images and video frames. While numerous solutions have been proposed for this problem in the past, they are usually not compatible with low-power mobile NPUs having many computational and memory constraints. In this Mobile AI challenge, we address this problem and propose the participants to design an efficient quantized image super-resolution solution that can demonstrate a real-time performance on mobile NPUs. The participants were provided with the DIV2K dataset and trained INT8 models to do a high-quality 3X image upscaling. The runtime of all models was evaluated on the Synaptics VS680 Smart Home board with a dedicated edge NPU capable of accelerating quantized neural networks. All proposed solutions are fully compatible with the above NPU, demonstrating an up to 60 FPS rate when reconstructing Full HD resolution images. A detailed description of all models developed in the challenge is provided in this paper.

Deep learning methods have contributed substantially to the rapid advancement of medical image segmentation, the quality of which relies on the suitable design of loss functions. Popular loss functions, including the cross-entropy and dice losses, often fall short of boundary detection, thereby limiting high-resolution downstream applications such as automated diagnoses and procedures. We developed a novel loss function that is tailored to reflect the boundary information to enhance the boundary detection. As the contrast between segmentation and background regions along the classification boundary naturally induces heterogeneity over the pixels, we propose the piece-wise two-sample t-test augmented (PTA) loss that is infused with the statistical test for such heterogeneity. We demonstrate the improved boundary detection power of the PTA loss compared to benchmark losses without a t-test component.

Low-light stereo image enhancement (LLSIE) is a relatively new task to enhance the quality of visually unpleasant stereo images captured in dark conditions. So far, very few studies on deep LLSIE have been explored due to certain challenging issues, i.e., the task has not been well addressed, and current methods clearly suffer from two shortages: 1) insufficient cross-view interaction; 2) lacking long-range dependency for intra-view learning. In this paper, we therefore propose a novel LLSIE model, termed \underline{Suf}ficient C\underline{r}oss-View \underline{In}teraction Network (SufrinNet). To be specific, we present sufficient inter-view interaction module (SIIM) to enhance the information exchange across views. SIIM not only discovers the cross-view correlations at different scales, but also explores the cross-scale information interaction. Besides, we present a spatial-channel information mining block (SIMB) for intra-view feature extraction, and the benefits are twofold. One is the long-range dependency capture to build spatial long-range relationship, and the other is expanded channel information refinement that enhances information flow in channel dimension. Extensive experiments on Flickr1024, KITTI 2012, KITTI 2015 and Middlebury datasets show that our method obtains better illumination adjustment and detail recovery, and achieves SOTA performance compared to other related methods. Our codes, datasets and models will be publicly available.

手眼校准问题是机器人研究中的重要应用问题。基于双重季节矢量的2个标准，我们为手眼校准问题提出了一种新的双季节优化方法。双重四基因优化问题分解为两个四基因优化子问题。第一个四基因优化子问题控制着机器人手的旋转。可以通过特征值分解或单数值分解有效地求解。如果第一个四基金优化子问题的最佳值为零，则系统无噪音，即，存在``Perfect''机器人手动运动，该机器人手动运动完全满足所有测试的旋转。在这种情况下，我们应用正规化技术来求解第二个子问题以最大程度地减少翻译的距离。否则，我们将修补技术应用于第二个四基因优化子问题。然后求解第二个四基因优化子问题是解决了二次约束二次程序。通过这种方式，我们为手眼校准问题的解决方案集提供了完整的描述。这在手眼校准文献中是新的。还提出了数值结果以显示所提出方法的效率。

区分计算机生成（CG）和自然摄影图像（PG）图像对于验证数字图像的真实性和独创性至关重要。但是，最近的尖端生成方法使CG图像中的合成质量很高，这使得这项具有挑战性的任务变得更加棘手。为了解决这个问题，提出了具有深层质地和高频特征的联合学习策略，以进行CG图像检测。我们首先制定并深入分析CG和PG图像的不同采集过程。基于这样的发现，即图像采集中的多个不同模块将导致对图像中基于卷积神经网络（CNN）渲染的不同敏感性不一致，我们提出了一个深层纹理渲染模块，以增强纹理差异和歧视性纹理表示。具体而言，生成语义分割图来指导仿射转换操作，该操作用于恢复输入图像不同区域中的纹理。然后，原始图像和原始图像和渲染图像的高频组件的组合被馈入配备了注意机制的多支球神经网络，该神经网络分别优化了中间特征，并分别促进了空间和通道维度的痕量探索。在两个公共数据集和一个具有更现实和多样化图像的新构建的数据集上进行的广泛实验表明，所提出的方法的表现优于现有方法，从而明确的余量。此外，结果还证明了拟议方法后处理操作和生成对抗网络（GAN）生成的图像的检测鲁棒性和泛化能力。

最近的工作表明，大型审慎的语言模型（LMS）不仅可以在一系列自然语言处理（NLP）任务上表现出色，而且还可以开始改进推理任务，例如算术诱导，象征性操纵，并随着规模的增加而进行常识性推理。模型。但是，目前尚不清楚这些LMS的潜在能力是什么。令人惊讶的是，我们发现这些模型对某些基本的符号操纵任务有局限性，例如复制，反向和加法。当符号总数或重复符号增加时，模型性能会迅速下降。我们研究了这种现象背后的潜在原因，并检查了一组可能的方法，包括明确的位置标记，细粒度的计算步骤以及具有可呼出程序的LMS。实验结果表明，这些技术都无法完全解决最简单的添加感应问题。最后，我们向导师介绍LMS，这展示了每一个教学的步骤。 LMS带有导师的LMS能够在OOD和重复符号的情况下提供100％的精度，从而在诱导中对大型LMS边界产生新的见解。

很少有图像生成和几张相关的图像翻译是两个相关的任务，这两个任务旨在为只有几张图像的看不见类别生成新图像。在这项工作中，我们首次尝试将几张图像翻译方法调整为几乎没有图像生成任务。几乎没有图像翻译将图像分解为样式向量和内容图。看不见的样式矢量可以与不同的见面内容映射结合使用，以产生不同的图像。但是，它需要存储可见的图像以提供内容图，并且看不见的样式向量可能与可见的内容映射不相容。为了使其适应少量图像生成任务，我们通过将连续内容映射量化为离散的内容映射而不是存储可见图像，从而学习了局部内容向量的紧凑词字典。此外，我们对根据样式向量进行的离散内容图的自回归分布进行建模，这可以减轻内容映射和样式向量之间的不兼容。三个真实数据集的定性和定量结果表明，与以前的方法相比，我们的模型可以为看不见的类别产生更高的多样性和忠诚度图像。